Ramsey and Turán-type problems in bipartite geometric graphs
نویسنده
چکیده
A = {(1, 0), (2, 0), . . . , (n, 0)}, B = {((1, 1), (2, 1), . . . , (n, 1)} and the edge ab is the line segment joining a ∈ A and b ∈ B in R. This model is essentially the same as the cyclic bipartite graphs and ordered bipartite graphs considered earlier by several authors. Subgraphs — paths, trees, double stars, matchings — are called non-crossing if they do not contain edges with common interior point. We determine the maximum number of edges in a bipartite geometric graph G(n, n) that does not contain
منابع مشابه
Ramsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs
Geometric versions of Ramsey-type and Turán-type problems are studied in a special but natural representation of bipartite graphs and similar questions are asked for general representations. A bipartite geometric graphG(m,n) = [A,B] is simple if the vertex classes A,B of G(m,n) are represented in R2 as A = {(1, 0), (2, 0), . . . , (m, 0)}, B = {(1, 1), (2, 1), . . . , (n, 1)} and the edge ab is...
متن کاملBeyond-Planarity: Density Results for Bipartite Graphs
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani [14]) for extremal problems on geometric graphs, but is also related to graph drawing problems ...
متن کاملTurán-type results for partial orders and intersection graphs of convex sets
We prove Ramsey-type results for intersection graphs of geometric objects the plane. In particular, we prove the following bounds, all of which are tight apart from the constant c. There is a constant c > 0 such that for every family F of n ≥ 2 convex sets in the plane, the intersection graph of F or its complement contains a balanced complete bipartite graph of size at least cn. There is a con...
متن کاملTura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions
For a graph H and an integer n, the Turán number ex(n,H) is the maximum possible number of edges in a simple graph on n vertices that contains no copy of H . H is rdegenerate if every one of its subgraphs contains a vertex of degree at most r. We prove that, for any fixed bipartite graph H in which all degrees in one colour class are at most r, ex(n,H) O(n2−1/r). This is tight for all values of...
متن کاملRamsey Numbers for Partially-ordered Sets
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of partially-ordered sets to form host graphs for Ramsey problems. We explore connections to well studied Turán-type problems in partially-ordered sets, particularly th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 31 شماره
صفحات -
تاریخ انتشار 2008